Stochastic flows on metric graphs
نویسندگان
چکیده
We study a simple stochastic differential equation (SDE) driven by one Brownian motion on a general oriented metric graph whose solutions are stochastic flows of kernels. Under some conditions, we describe the laws of all solutions. This work is a natural continuation of [17, 8, 10] where some particular metric graphs were considered.
منابع مشابه
Stochastic flows and an interface SDE on metric graphs
This paper consists in the study of a stochastic differential equation on a metric graph, called an interface SDE (ISDE). To each edge of the graph is associated an independent white noise, which drives (ISDE) on this edge. This produces an interface at each vertex of the graph. We first do our study on star graphs with N ≥ 2 rays. The case N = 2 corresponds to the perturbed Tanaka’s equation r...
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کامل